Parallel Implementation of Italiano's Incremental Algorithm for Dynamic Updating the Transitive Closure
نویسنده
چکیده
The transitive closure (or reachability) problem in a directed graph consists in finding whether there is a path between any two vertices. In this paper, we first study the problem of parallelization of Italiano's algorithm for dynamic updating the transitive closure after inserting a new arc into the graph represented as a list of arcs. To this end, by means of the data structure first proposed in [9], Italiano's incremental algorithm is represented in a natural way on a model of an associative parallel processor with vertical processing (the STAR-machine). Associative version of Italiano's incremental algorithm is given as procedure InsertArc for the STAR-machine. We prove correctness of this procedure and evaluate its time complexity. We also compare implementations of Italiano's incremental algorithm and its associative version and present the main advantages of the associative version.
منابع مشابه
A First Experimental Study of aDynamic Transitive Closure
We describe an implementation of Italiano's partially dynamic data structure for maintaining transitive closure information in a directed graph and report on experimental results with random directed graphs and random sequences of operations. The operations supported are edge insertions or edge deletions, and queries. For the case of edge deletions the directed graph is assumed to be acyclic.
متن کاملEfficient Implementation of the Italiano Algorithms for Updating the Transitive Closure on Associative Parallel Processors
We propose a simple data structure for an efficient implementation of the Italiano algorithms for the dynamic updating of the transitive closure of a directed graph represented as adjacency matrix on a model of associative (or content addressable) parallel processors with vertical processing (the STAR–machine). Associative versions of the Italiano algorithms are represented as procedures Delete...
متن کاملUpdating Direct Graph for Incremental Reasoning in OWL 2 QL Ontology
We propose an incremental reasoning approach to QL ontologies by mapping an evolving ontology to an updatable digraph and maintaining dynamic transitive closure to obtain incremental classification. We describe the procedure of updating ontology digraph and present an approach to identify the affected paths for incremental classification. We implement the proposed method in a prototype incR and...
متن کاملThe Effect of Transitive Closure on the Calibration of Logistic Regression for Entity Resolution
This paper describes a series of experiments in using logistic regression machine learning as a method for entity resolution. From these experiments the authors concluded that when a supervised ML algorithm is trained to classify a pair of entity references as linked or not linked pair, the evaluation of the model’s performance should take into account the transitive closure of its pairwise lin...
متن کاملInteraction Challenges for the Dynamic Construction of Partially-Ordered Sets
We describe a technique for user interaction with the interim results of Formal Concept Analysis which we hypothesise will expedite user comprehension of the resultant concept lattice. Given any algorithm which enumerates the concepts of a formal context, this technique incrementally updates the set of formal concepts generated so far, the transitive reduction of the ordering relation between t...
متن کامل